首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   96篇
  免费   42篇
  国内免费   4篇
  2024年   1篇
  2023年   4篇
  2022年   2篇
  2021年   7篇
  2020年   5篇
  2019年   4篇
  2018年   2篇
  2017年   7篇
  2016年   10篇
  2015年   10篇
  2014年   6篇
  2013年   7篇
  2012年   4篇
  2011年   9篇
  2010年   8篇
  2009年   5篇
  2008年   12篇
  2007年   4篇
  2006年   8篇
  2005年   6篇
  2004年   3篇
  2003年   1篇
  2002年   2篇
  2001年   2篇
  2000年   3篇
  1999年   1篇
  1998年   2篇
  1996年   1篇
  1994年   2篇
  1993年   2篇
  1991年   1篇
  1990年   1篇
排序方式: 共有142条查询结果,搜索用时 62 毫秒
51.
为了满足通信容量的需求,在发射端和接收端设置多元素天线阵列构成多输入多输出系统,可以显著提高频谱的利用率.基于贝尔实验室提出的非线性迫零检测算法,提出了反向迫零检测算法.理论和仿真证明,在相同信噪比条件下,反向迫零检测算法获得的系统容量高于非线性迫零检测以及线性迫零检测算法.与奇异值分解算法相比,该算法虽然得到的系统容量有所减小,但是由于所需的运算量相对较小,因而易于实现.  相似文献   
52.
Stochastic dynamic programming models are attractive for multireservoir control problems because they allow non‐linear features to be incorporated and changes in hydrological conditions to be modeled as Markov processes. However, with the exception of the simplest cases, these models are computationally intractable because of the high dimension of the state and action spaces involved. This paper proposes a new method of determining an operating policy for a multireservoir control problem that uses stochastic dynamic programming, but is practical for systems with many reservoirs. Decomposition is first used to reduce the problem to a number of independent subproblems. Each subproblem is formulated as a low‐dimensional stochastic dynamic program and solved to determine the operating policy for one of the reservoirs in the system. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006  相似文献   
53.
S-四嗪类高氮含能化合物的合成及性能   总被引:1,自引:0,他引:1       下载免费PDF全文
以3,6-对(3,5-二甲基吡唑)-S-四嗪(BT)为起始物,研究了S-四嗪类高氮含能化合物3-氨基-6-(3,5-二甲基吡唑)-S-四嗪(ADMPT)、3-肼基-6-(3,5-二甲基吡唑)-S-四嗪(HDMPT)、3,6-二氨基-S-四嗪(DATz)、3,6-二肼基-S-四嗪(DHTz)与3,3’-偶氮-(6-氨基-S-四嗪)(DAAT)的合成,经IR、元素分析、1HNMR、13CNMR等对其结构进行了表征和确认。对DHTz和DAAT的热分解性能进行了研究,由不同升温速率下的DSC实验获得了其热分解动力学参数。结果表明DAAT热稳定性好、能量高,在10℃/min升温速率下,DAAT在280℃开始分解,放热峰值330℃,放热峰的分解焓为1974.33J/g;DHTz在120℃开始分解,放热峰值159℃,放热峰的分解焓为1843.23J/g。同时,采用高温高压爆轰产物状态方程(VLW EOS)对DHTz和DAAT的爆轰性能进行了理论计算。  相似文献   
54.
平台式惯导系统初始对准最佳可观性分析   总被引:1,自引:0,他引:1  
首先应用线性系统的奇异值分解理论对静基座初始对准的可观性及可观度进行了深入地分析.给出了不同奇异值下系统状态可观性状况的直方图,并且计算出不同状态组合时系统奇异值的大小及对可观性的影响.理论分析表明选取(△)N、(△)E、εE为不可观测时,系统的估计效果最好.其次采用卡尔曼滤波器对可观阵的秩为7的三种状态组合进行最优估计,仿真结果验证这种论断的正确性.最后从误差分析的角度阐述了这种论断的合理性.  相似文献   
55.
We consider the parallel replacement problem in which machine investment costs exhibit economy of scale which is modeled through associating both fixed and variable costs with machine investment costs. Both finite- and infinite-horizon cases are investigated. Under the three assumptions made in the literature on the problem parameters, we show that the finite-horizon problem with time-varying parameters is equivalent to a shortest path problem and hence can be solved very efficiently, and give a very simple and fast algorithm for the infinite-horizon problem with time-invariant parameters. For the general finite-horizon problem without any assumption on the problem parameters, we formulate it as a zero-one integer program and propose an algorithm for solving it exactly based on Benders' decomposition. Computational results show that this solution algorithm is efficient, i.e., it is capable of solving large scale problems within a reasonable cpu time, and robust, i.e., the number of iterations needed to solve a problem does not increase quickly with the problem size. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 279–295, 1998  相似文献   
56.
针对快速传递对准中主子惯导相对姿态存在大角度的情况,推导了捷联惯导大失准角误差模型.该模型采用欧拉角表示姿态误差,并用欧拉运动方程准确描述其传播规律.鉴于该模型中的姿态观测方程是复杂的非线性函数,采用无需求导的UKF算法,并采用奇异值分解(SVD)解决方差阵的病态问题.仿真结果表明,该算法在小角度误差条件下滤波精度优于线性模型,并且适用于大角度误差条件.  相似文献   
57.
利用四元数矩阵的奇异值分解(SVD),对两个四元数长矩阵给出了其同时复对角化的充要条件,进一步对一个四元数长矩阵集合,针对其同时复对角化问题,给出了一系列充分必要条件.  相似文献   
58.
GPS初始整周模糊度的求解是利用载波相位进行测量时的关键问题.采用了对系数矩阵进行QR分解的方法,用以降低矩阵的维数.模糊度搜索时,针对Z变换可能会引入多余误差,采用了对称三角分解法对协方差矩阵进行去相关处理.实验与仿真结果表明,定位误差在0.5 cm以内,方位角和仰角误差在0.1°以内.  相似文献   
59.
In this article, we consider a multi‐product closed‐loop supply chain network design problem where we locate collection centers and remanufacturing facilities while coordinating the forward and reverse flows in the network so as to minimize the processing, transportation, and fixed location costs. The problem of interest is motivated by the practice of an original equipment manufacturer in the automotive industry that provides service parts for vehicle maintenance and repair. We provide an effective problem formulation that is amenable to efficient Benders reformulation and an exact solution approach. More specifically, we develop an efficient dual solution approach to generate strong Benders cuts, and, in addition to the classical single Benders cut approach, we propose three different approaches for adding multiple Benders cuts. These cuts are obtained via dual problem disaggregation based either on the forward and reverse flows, or the products, or both. We present computational results which illustrate the superior performance of the proposed solution methodology with multiple Benders cuts in comparison to the branch‐and‐cut approach as well as the traditional Benders decomposition approach with a single cut. In particular, we observe that the use of multiple Benders cuts generates stronger lower bounds and promotes faster convergence to optimality. We also observe that if the model parameters are such that the different costs are not balanced, but, rather, are biased towards one of the major cost categories (processing, transportation or fixed location costs), the time required to obtain the optimal solution decreases considerably when using the proposed solution methodology as well as the branch‐and‐cut approach. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007  相似文献   
60.
针对光滑粒子动力学主要计算量是近邻粒子搜索这一特点,提出了一种基于粒子分解的光滑粒子动力学并行计算方案。利用该方案可以方便地将任意串行光滑粒子动力学代码并行计算,而且每一个时间步内的信息传递量只和粒子总数有关,而和粒子的分布无关,因而特别适合于自由表面流动等大变形问题的并行数值模拟。对一个粒子总数为40万的三维溃坝问题的模拟结果表明:此方案能达到的最大加速比约为16,这一结果可能比空间分解方案(不考虑动态负载均衡)更优。  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号